Eecient Computation of the Most Probable Motion from Fuzzy Correspondences
نویسندگان
چکیده
An algorithm is presented for nding the most probable image motion between two images from fuzzy point correspondences. In fuzzy correspondence a point in one image is assigned to a region in the other image. Such a region can be line (aperture eeect) or a probability matrix. Noise and outliers are always present, and points may come from diierent motions. The presented algorithm, which uses linear programming , recovers the motion parameters and performs outlier rejection and motion-segmentation at the same time. The linear program computes the global optimum without an initial guess.
منابع مشابه
E cient Computation of the Most Probable Motion from Fuzzy Correspondences
An algorithm is presented for nding the most probable image motion between two images from fuzzy point correspondences. In fuzzy correspondence a point in one image is assigned to a region in the other image. Such a region can be line (aperture e ect) or a probability matrix. Noise and outliers are always present, and points may come from di erent motions. The presented algorithm, which uses li...
متن کاملEfficient computation of the most probable motion from fuzzy correspondences
An algorithm is presented for finding the most probable image motion between two images from fuzzy point correspondences. In fuzzy correspondence a point in one image is assigned to a region in the other image. Such a region can be line (aperture effect) or a convex polygon. Noise and outliers are always present, and points may belong to different motions. The presented algorithm, which uses li...
متن کاملAn Eecient Algorithm for Nding the M Most Probable Conngurations in Probabilistic Expert Systems
A probabilistic expert system provides a graphical representation of a joint probability distribution which enables local computations of probabilities. Dawid (1992) provided a ``ow-propagation' algorithm for nding the most probable connguration of the joint distribution in such a system. This paper analyses that algorithm in detail, and shows how it can be combined with a clever partitioning s...
متن کاملReal-Time Motion Analysis with Linear-Programming
A method to compute motion models in real time from point-to-line correspondences using linear programming is presented. Point-to-line correspondences are the most reliable motion measurements given the aperture effect, and it is shown how they can approximate other motion measurements as well. Using an L1 error measure for image alignment based on point-to-line correspondences and minimizing t...
متن کاملClosed Form Solution to the Structure from Motion Problem from Line Correspondences
A theory is presented for the computation of three dimensional motion and structure from dynamic imagery, using only line correspondences. The traditional approach of corresponding microfeatures (interesting points-highlights, corners, high curvature points, etc.) is reviewed and its shortcomings are discussed. Then, a theory is presented that describes a closed form solution to the motion and ...
متن کامل